GraphChi : Large - Scale Graph Computation on Just a
نویسندگان
چکیده
Opening Remarks Summarized by Rik Farrow ([email protected]) Program Co-chair Amin Vahdat opened the conference, telling the audience that this year’s attendance was high, close to but not greater than the record for OSDI. Vahdat explained the review process: 25 out of 215 papers were accepted, producing 1079 written reviews. Authors were sent reviewers’ comments so that they could address any concerns about the research before they submitted their final versions of their papers.
منابع مشابه
GraphChi: Large-Scale Graph Computation on Just a PC
Current systems for graph computation require a distributed computing cluster to handle very large real-world problems, such as analysis on social networks or the web graph. While distributed computational resources have become more accessible, developing distributed graph algorithms still remains challenging, especially to non-experts. In this work, we present GraphChi, a disk-based system for...
متن کاملLarge-scale Graph Computation on Just a PC
Current systems for graph computation require a distributed computing cluster to handle very large real-world problems, such as analysis on social networks or the web graph. While distributed computational resources have become more accessible, developing distributed graph algorithms still remains challenging, especially to non-experts. In this work, we present GraphChi, a disk-based system for...
متن کاملGraphChi-DB: Simple Design for a Scalable Graph Database System - on Just a PC
We propose a new data structure, Parallel Adjacency Lists (PAL), for efficiently managing graphs with billions of edges on disk. The PAL structure is based on the graph storage model of GraphChi [14], but we extend it to enable online database features such as queries and fast insertions. In addition, we extend the model with edge and vertex attributes. Compared to previous data structures, PAL...
متن کاملBPP: Large Graph Storage for Efficient Disk Based Processing
Processing very large graphs like social networks, biological and chemical compounds is a challenging task. Distributed graph processing systems process the billion-scale graphs efficiently but incur overheads of efficient partitioning and distribution of the graph over a cluster of nodes. Distributed processing also requires cluster management and fault tolerance. In order to overcome these pr...
متن کاملAn Experimental Evaluation of k-core Decomposition on Giraph and GraphChi
The analysis of characteristics of large-scale graphs has shown tremendous benefits in social networks, spam detection, epidemic disease control, analyzing software systems and so on. However, today, processing graph algorithms on massive datasets is not an easy task not only because of the large data volume, but also the complexity of the graph algorithm. Therefore, a number of large-scale pro...
متن کامل